Disjoint sum forms in reliability theory
نویسندگان
چکیده
منابع مشابه
Disjoint Sum Forms in Reliability Theory
The structure function φ of a binary monotone system is assumed to be known and given in a disjunctive normal form, i.e. as the logical union of products of the indicator variables of the states of its subsystems. Based on this representation of φ, an improved Abraham algorithm is proposed for generating the disjoint sum form of φ. This form is the base for subsequent numerical reliability calc...
متن کاملFuzzy Reliability of a Network Using Fuzzy Sum of Disjoint Product Technique
In this study, we proposed a method to find the fuzzy reliability of the network using fuzzy sum-of-disjoint product technique. We use the fuzzy graph theory techniques for addressing the reliability of a network with known minimal paths. We have also presented an efficient algorithm to find the reliability of the network.
متن کاملDiagonal forms for incidence matrices and zero-sum Ramsey theory
We consider integer matrices Nt whose rows are indexed by the t-subsets of an n-set and whose columns are all distinct images of a particular column under the symmetric group Sn. Examples include matrices in the association algebras of the Johnson schemes. Three related problems are addressed. What is the Smith normal form (or a diagonal form) for Nt and the rank of Nt over a field of character...
متن کاملDisjoint forms in graphical user interfaces
Forms are parts of a graphical user interface (GUI) that show a (structured) value and allow the user to update it. Some forms express a choice between two or more (structured) values using radio buttons or check boxes. We show that explicitly modelling such a choice leads to a cleaner separation of logic and layout. This is done by extending the combinator library FunctionalForms with disjoint...
متن کاملPreprocessing minpaths for sum of disjoint products
Network reliability algorithms which produce sums of disjoint products (SDP) are sensitive to the order in which the minimal pathsets are analyzed. The minpaths are preprocessed by choosing this order in the hope that an SDP algorithm will then provide a relatively efficient analysis. The most commonly used preprocessing strategy is to list the minpaths in order of increasing size. This paper g...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: ORiON
سال: 2014
ISSN: 2224-0004
DOI: 10.5784/16-1-413